Interval Temporal Logic on Natural Numbers
نویسنده
چکیده
We introduce a theory of temporal logic operators using sets of natural numbers as time domain, formalized in a shallow embedding manner. The theory comprises special natural intervals (theory IL Interval: open and closed intervals, continuous and modulo intervals, interval traversing results), operators for shifting intervals to left/right on the number axis as well as expanding/contracting intervals by constant factors (theory IL IntervalOperators.thy), and ultimately definitions and results for unary and binary temporal operators on arbitrary natural sets (theory IL TemporalOperators).
منابع مشابه
Decidability of the Interval Temporal Logic ABB over the Natural Numbers
In this paper, we focus our attention on the interval temporal logic of the Allen’s relations “meets”, “begins”, and “begun by” (ABB for short), interpreted over natural numbers. We first introduce the logic and we show that it is expressive enough to model distinctive interval properties, such as accomplishment conditions, to capture basic modalities of point-based temporal logic, such as the ...
متن کاملDecidability of the interval temporal logic ABBar over the natural numbers
In this paper, we focus our attention on the interval temporal logic of the Allen’s relations “meets”, “begins”, and “begun by” (ABB for short), interpreted over natural numbers. We first introduce the logic and we show that it is expressive enough to model distinctive interval properties, such as accomplishment conditions, to capture basic modalities of point-based temporal logic, such as the ...
متن کاملCrossing the Undecidability Border with Extensions of Propositional Neighborhood Logic over Natural Numbers
Propositional Neighborhood Logic (PNL) is an interval temporal logic featuring two modalities corresponding to the relations of right and left neighborhood between two intervals on a linear order (in terms of Allen’s relations, meets and met by). Recently, it has been shown that PNL interpreted over several classes of linear orders, including natural numbers, is decidable (NEXPTIME-complete) an...
متن کاملInterval-based Synthesis
In this paper, we introduce the synthesis problem for Halpern and Shoham’s interval temporal logic [5] extended with an equivalence relation ∼ over time points (HS ∼ for short). In analogy to the case of monadic second-order logic of one successor [2], given an HS ∼ formula φ and a finite set ΣT of proposition letters and temporal requests, the problem consists of establishing whether or not, f...
متن کاملMetric Temporal Description Logics with Interval-Rigid Names (Extended Abstract)
In contrast to qualitative linear temporal logics, which can be used to state that some property will eventually be satisfied, metric temporal logics allow to formulate constraints on how long it may take until the property is satisfied. While most of the work on combining Description Logics (DLs) with temporal logics has concentrated on qualitative temporal logics, there has recently been a gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Archive of Formal Proofs
دوره 2011 شماره
صفحات -
تاریخ انتشار 2011